1454A - Special Permutation - CodeForces Solution

constructive algorithms probabilities *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    a = list(range(1, int(input()) + 1))
    print(' '.join(map(str, [a[-1]] + a[:-1])))

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long a,b,c=0,h,d,e,f=0,sum=0,j,cnt=0,flag=0,k=0,in1,in2,p1,p2,g,w,m=0,n;
    vector<int>v;
    stringstream a1,b1;
    cin>>n;
    while(n--)
    {
         cin>>a;
         if(a%2!=0)
         {
             c=(a/2)+1;
         }
      for(int i=a;i>=1;i--)
      {
          if(i==c)
          {
              m=i;
              continue;
          }
          else
          {
               cout<<i<<" ";
          }
          if(i==1)
          {
              if(m)
              {
                  cout<<m;
              }
          }

      }
      cout<<endl;
      c=0;
      m=0;
    }



}


Comments

Submit
0 Comments
More Questions

1711D - Rain
534A - Exam
1472A - Cards for Friends
315A - Sereja and Bottles
1697C - awoo's Favorite Problem
165A - Supercentral Point
1493A - Anti-knapsack
1493B - Planet Lapituletti
747B - Mammoth's Genome Decoding
1591C - Minimize Distance
1182B - Plus from Picture
1674B - Dictionary
1426C - Increase and Copy
520C - DNA Alignment
767A - Snacktower
1365A - Matrix Game
714B - Filya and Homework
31A - Worms Evolution
1691A - Beat The Odds
433B - Kuriyama Mirai's Stones
892A - Greed
32A - Reconnaissance
1236D - Alice and the Doll
1207B - Square Filling
1676D - X-Sum
1679A - AvtoBus
1549A - Gregor and Cryptography
918C - The Monster
4B - Before an Exam
545B - Equidistant String